Z and Hoare Logics
نویسنده
چکیده
Z is gaining ground in the software development community as a specification language, but there is at present no standard way of relating a Z specification to program code. Hoare logics have been around for about 20 years. They are well understood and widely taught as a method of proving that a program meets its specification. In this paper I look at how a software development might use both techniques and both notations to provide a path from a high-level Z specification to program code. Rules and conventions for combining the two notations are given and their use is illustrated by two case studies. Antoni Diller, “Z and Hoare Logics”, in J. E. Nicholls (eds.), Z User Workshop: York 1991, [London, Springer-Verlag, 1992], pp. 59–76.
منابع مشابه
How to Cook a Complete Hoare Logic for Your Pet OO Language
This paper introduces a general methodology for obtaining complete Hoare logics for object-oriented languages. The methodology is based on a new completeness result of a Hoare logic for a procedural language with dynamically allocated variables. This new result involves a generalization of Gorelick’s seminal completeness result of the standard Hoare logic for recursive procedures with simple va...
متن کاملA Hoare-like logic of asserted single-pass instruction sequences
We present a formal system for proving the partial correct-ness of a single-pass instruction sequence as considered in program algebra by decomposition into proofs of the partial correctness of segments of the single-pass instruction sequence concerned. The system is similar to Hoare logics, but takes into account that, by the presence of jump instructions , segments of single-pass instruction ...
متن کاملSeparation logics and modalities: a survey
Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoarestyle proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoa...
متن کاملTowards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991